Optimization of urban emergency support material distribution under major public health emergencies based on improved sparrow search algorithm.

The outbreak of major public health emergencies such as the coronavirus epidemic has put forward new requirements for urban emergency management procedures. Accuracy and effective distribution model of emergency support materials, as an effective tool to inhibit the deterioration of the public health sector, have gradually become a research hotspot. The distribution of urban emergency support devices, under the secondary supply chain structure of "material transfer center-demand point," which may involve confusing demands, is studied to determine the actual situation of fuzzy requests under the impact of an epidemic outbreak. An optimization model of urban emergency support material distribution, based on Credibility theory, is first constructed. Then an improved sparrow search algorithm, ISSA, was designed by introducing Sobol sequence, Cauchy variation and bird swarm algorithm into the structure of the classical SSA. In addition, numerical validation and standard test set validation were carried out and the experimental results showed that the introduced improved strategy effectively improved the global search capability of the algorithm. Furthermore, simulation experiments are conducted, based on Shanghai, and the comparison with existing cutting-edge algorithms shows that the designed algorithm has stronger superiority and robustness. And the simulation results show that the designed algorithm can reduce vehicle cost by 4.83%, time cost by 13.80%, etc. compared to other algorithms. Finally, the impact of preference value on the distribution of emergency support materials is analyzed to help decision-makers to develop reasonable and effective distribution strategies according to the impact of major public health emergencies. The results of the study provide a practical reference for the solution of urban emergency support materials distribution problems.

Same-day delivery with fair customer service

The demand for same-day delivery (SDD) has increased rapidly in the last few years and has particu-larly boomed during the COVID-19 pandemic. The fast growth is not without its challenge. In 2016, due to low concentrations of memberships and far distance from the depot, certain minority neighborhoods were excluded from receiving Amazon's SDD service, raising concerns about fairness. In this paper, we study the problem of offering fair SDD service to customers. The service area is partitioned into differ-ent regions. Over the course of a day, customers request for SDD service, and the timing of requests and delivery locations are not known in advance. The dispatcher dynamically assigns vehicles to make de-liveries to accepted customers before their delivery deadline. In addition to overall service rate ( utility ), we maximize the minimal regional service rate across all regions ( fairness ). We model the problem as a multi-objective Markov decision process and develop a deep Q-learning solution approach. We introduce a novel transformation of learning from rates to actual services, which creates a stable and efficient learn-ing process. Computational results demonstrate the effectiveness of our approach in alleviating unfairness both spatially and temporally in different customer geographies. We show this effectiveness is valid with different depot locations, providing businesses with an opportunity to achieve better fairness from any location. We also show that the proposed approach performs efficiently when serving heterogeneously wealthy districts in the city.(c) 2022 Elsevier B.V. All rights reserved.

Evolutionary Optimization of COVID-19 Vaccine Distribution With Evolutionary Demands

Vaccination uptake has become the key factor that will determine our success in containing the coronavirus pneumonia (COVID-19) pandemic. Efficient distribution of vaccines to inoculation spots is crucial to curtailing the spread of the novel COVID-19 pandemic. Normally, in a big city, a huge number of vaccines need to be transported from central depot(s) through a set of satellites to widely scattered inoculation spots by special-purpose vehicles every day. Such a large two-echelon vehicle routing problem is computationally difficult. Moreover, the demands for vaccines evolve with the epidemic spread over time, and the actual demands are hard to determine early and exactly, which not only increases the problem difficulty but also prolongs the distribution time. Based on our practical experience of COVID-19 vaccine distribution in China, we present a hybrid machine learning and evolutionary computation method, which first uses a fuzzy deep learning model to forecast the demands for vaccines for each next day, such that we can predistribute the forecasted number of vaccines to the satellites in advance;after obtaining the actual demands, it uses an evolutionary algorithm (EA) to route vehicles to distribute vaccines from the satellites/depots to the inoculation spots on each day. The EA saves historical problem instances and their high-quality solutions in a knowledge base, so as to capture inherent relationship between evolving problem inputs to solutions;when solving a new problem instance on each day, the EA utilizes historical solutions that perform well on the similar instances to improve initial solution quality and, hence, accelerate convergence. Computational results on real-world instances of vaccine distribution demonstrate that the proposed method can produce solutions with significantly shorter distribution time compared to state-of-the-arts and, hence, contribute to accelerating the achievement of herd immunity.

Multi-objective Harris Hawks Optimization for Optimal Emergency Vehicle Dispatching During a Pandemic

Harris Hawks Optimization (HHO) is a Swarm Intelligence (SI) algorithm that is inspired by the cooperative behavior and hunting style of Harris Hawks in the nature. Researchers' interest in HHO is increasing day by day because it has global search capability, fast convergence speed and strong robustness. On the other hand, Emergency Vehicle Dispatching (EVD) is a complex task that requires exponential time to choose the right emergency vehicles to deploy, especially during pandemics like COVID-19. Therefore, in this work we propose to model the EVD problem as a multi-objective optimization problem where a potential solution is an allocation of patients to ambulances and the objective is to minimize the travelling cost while maximizing early treatment of critical patients. We also propose to use HHO to determine the best allocation within a reasonable amount of time. We evaluate our proposed HHO for EVD using 2 synthetic datasets. We compare the results of the proposed approach with those obtained using a modified version of Particle Swarm Optimization (PSO). The experimental analysis shows that the proposed multi-objective HHO for EVD is very competitive and gives a substantial improvement over the enhanced PSO algorithm in terms of performance. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Route Optimization of Mobile Medical Unit with Reinforcement Learning

In this paper, we propose a solution for optimizing the routes of Mobile Medical Units (MMUs) in the domain of vehicle routing and scheduling. The generic objective is to optimize the distance traveled by the MMUs as well as optimizing the associated cost. These MMUs are located at a central depot. The idea is to provide improved healthcare to the rural people of India. The solution is obtained in two stages: preparing a mathematical model with the most suitable parameters, and then in the second phase, implementing an algorithm to obtain an optimized solution. The solution is focused on multiple parameters, including the number of vans, number of specialists, total distance, total travel time, and others. The solution is further supported by Reinforcement Learning, explaining the best possible optimized route and total distance traveled.

Operation policy of multi-capacity logistic robots in hotel industry

Purpose: This paper aims to propose an operation policy of multi-capacity room service robots traveling within a hotel. As multi-capacity robots can serve many requests in a single trip, improved operation policy can reduce the investment cost of robots. Design/methodology/approach: Using a mathematical model-based optimization technique, an optimal set of robots with minimum installation cost is derived while serving the entire room service demands. Through testing a variety of scenarios by changing the price and function of robots to be installed, insights that consider the various situations are offered. Findings: Though the increase in capacity saves much time for room service at a lower capacity level, the amount of time saved gradually decreases as the capacity increases. Besides, the installation strategy is divided into two cases depending on the purchase cost of robots. Research limitations/implications: Currently, the studies focusing on the adoption of service robots from an operations view are rarely be found. To reduce the burden of investment cost, this study takes the unique approach to improve the operation policy of service robots by using the multi-capacity robots. Practical implications: This study guides the hotel to install an adequate set of robots. The result confirms that the optimal installation set of robots is affected by various factors, such as the room service information, the hotel structure and the unit execution cycle. Originality/value: After the outbreak of COVID-19, people avoid face-to-face contact and interest in non-contact service is growing. This paper deals with the efficient way to implement non-contact delivery through logistic robots, a timely and important topic. (PsycInfo Database Record (c) 2023 APA, all rights reserved)

Drones-aided Asset Maintenance in Hospitals

The rapid outbreak of COVID-19 pandemic invoked scientists and researchers to prepare the world for future disasters. During the pandemic, global authorities on healthcare urged the importance of disinfection of objects and surfaces. To implement efficient and safe disinfection services during the pandemic, robots have been utilized for indoor assets. In this paper, we envision the use of drones for disinfection of outdoor assets in hospitals and other facilities. Such heterogeneous assets may have different service demands (e.g., service time, quantity of the disinfectant material etc.), whereas drones have typically limited capacity (i.e., travel time, disinfectant carrying capacity). To serve all the facility assets in an efficient manner, the drone to assets allocation and drone travel routes must be optimized. In this paper, we formulate the capacitated vehicle routing problem (CVRP) to find optimal route for each drone such that the total service time is minimized, while simultaneously the drones meet the demands of each asset allocated to it. The problem is solved using mixed integer programming (MIP). As CVRP is an NP-hard problem, we propose a lightweight heuristic to achieve sub-optimal performance while reducing the time complexity in solving the problem involving a large number of assets. © 2022 IEEE.

Robust Task Scheduling for Heterogeneous Robot Teams Under Capability Uncertainty

This article develops a stochastic programming framework for multiagent systems, where task decomposition, assignment, and scheduling problems are simultaneously optimized. The framework can be applied to heterogeneous mobile robot teams with distributed subtasks. Examples include pandemic robotic service coordination, explore and rescue, and delivery systems with heterogeneous vehicles. Owing to their inherent flexibility and robustness, multiagent systems are applied in a growing range of real-world problems that involve heterogeneous tasks and uncertain information. Most previous works assume one fixed way to decompose a task into roles that can later be assigned to the agents. This assumption is not valid for a complex task where the roles can vary and multiple decomposition structures exist. Meanwhile, it is unclear how uncertainties in task requirements and agent capabilities can be systematically quantified and optimized under a multiagent system setting. A representation for complex tasks is proposed: agent capabilities are represented as a vector of random distributions, and task requirements are verified by a generalizable binary function. The conditional value at risk is chosen as a metric in the objective function to generate robust plans. An efficient algorithm is described to solve the model, and the whole framework is evaluated in two different practical test cases: capture-the-flag and robotic service coordination during a pandemic (e.g., COVID-19). Results demonstrate that the framework is generalizable, is scalable up to 140 agents and 40 tasks for the example test cases, and provides low-cost plans that ensure a high probability of success.

Optimization Model and Algorithm of Logistics Vehicle Routing Problem under Major Emergency

The novel coronavirus pandemic is a major global public health emergency, and has presented new challenges and requirements for the timely response and operational stability of emergency logistics that were required to address the major public health events outbreak in China. Based on the problems of insufficient timeliness and high total system cost of emergency logistics distribution in major epidemic situations, this paper takes the minimum vehicle distribution travel cost, time cost, early/late punishment cost, and fixed cost of the vehicle as the target, the soft time window for receiving goods at each demand point, the rated load of the vehicle, the volume, maximum travel of the vehicle in a single delivery as constraints, and an emergency logistics vehicle routing problem optimization model for major epidemics was constructed. The convergence speed improvement strategy, particle search improvement strategy, and elite retention improvement strategy were introduced to improve the particle swarm optimization (PSO) algorithm for it to be suitable for solving global optimization problems. The simulation results prove that the improved PSO algorithm required to solve the emergency medical supplies logistics vehicle routing problem for the major emergency can reach optimal results. Compared with the basic PSO algorithm, the total cost was reduced by 20.09%. © 2023 by the authors.

A Tailored Meta-Heuristic for the Autonomous Electric Vehicle Routing Problem Considering the Mixed Fleet

In recent years, some phenomena such as the COVID-19 pandemic have caused the autonomous vehicle (AV) to attract much attention in theoretical and applied research. This paper addresses the optimization problem of a heterogeneous fleet that consists of autonomous electric vehicles (AEVs) and conventional vehicles (CVs) in a Business-to-Consumer (B2C) distribution system. The absence of the driver in AEVs results in the necessity of studying two factors in modeling the problem, namely time windows in the routing plan and different compartments in the loading space of AEVs. We developed a mathematical model based on these properties, that was NP-hard. Then we proposed a hybrid algorithm, including variable neighborhood search (VNS) via neighborhood structure of large neighborhood search (LNS), namely the VLNS algorithm. The numerical results shed light on the proficiency of the algorithm in terms of solution time and solution quality. In addition, employing AEVs in the mixed fleet is considered to be desirable based on the operational cost of the fleet. The numerical results show the operational cost in the mixed fleet decreases on average by 57.22% compared with the homogeneous fleet.

Developing a solution algorithm for the autonomous electric vehicle routing problem considering the mixed fleet

In recent years, some phenomena such as the COVID-19 pandemic have caused the autonomous vehicle (AV) to attract much attention in theoretical and applied research. This paper addresses the optimization problem of a heterogeneous fleet that consists of autonomous electric vehicles (AEVs) and conventional vehicles (CVs) in a Business-to-Consumer (B2C) distribution system. The absence of the driver in AEVs results in the necessity of studying two factors in modeling the problem, namely time windows in the routing plan and different compartments in the loading space of AEVs. The arrival and departure times of the AEV at the customer’s location must be pre-planned, because, the AEV is not able to decide what to do if the customer is late at this point. Also, due to increasing the security of the loads inside the AEVs and the lack of control of the driver during the delivery of the goods, each customer should only have access to his/her orders. Therefore, the compartmentation of the AEV’s loading area has been proposed in its conceptual model. We developed a mathematical model based on these properties and proposed a hybrid algorithm, including variable neighborhood search (VNS) via neighborhood structure of large neighborhood search (LNS), namely the VLNS algorithm. The numerical results shed light on the proficiency of the algorithm in terms of solution time and solution quality. In addition, employing AEVs in the mixed fleet is considered to be desirable based on the operational cost of the fleet. Author

A Multipopulation Multiobjective Ant Colony System Considering Travel and Prevention Costs for Vehicle Routing in COVID-19-Like Epidemics

As transportation system plays a vastly important role in combatting newly-emerging and severe epidemics like the coronavirus disease 2019 (COVID-19), the vehicle routing problem (VRP) in epidemics has become an emerging topic that has attracted increasing attention worldwide. However, most existing VRP models are not suitable for epidemic situations, because they do not consider the prevention cost caused by issues such as viral tests and quarantine during the traveling. Therefore, this paper proposes a multi-objective VRP model for epidemic situations, named VRP4E, which considers not only the traditional travel cost but also the prevention cost of the VRP in epidemic situations. To efficiently solve the VRP4E, this paper further proposes a novel algorithm named multi-objective ant colony system algorithm for epidemic situations, termed MOACS4E, together with three novel designs. First, by extending the efficient “multiple populations for multiple objectives” framework, the MOACS4E adopts two ant colonies to optimize the travel and prevention costs respectively, so as to improve the search efficiency. Second, a pheromone fusion-based solution generation method is proposed to fuse the pheromones from different colonies to increase solution diversity effectively. Third, a solution quality improvement method is further proposed to improve the solutions for the prevention cost objective. The effectiveness of the MOACS4E is verified in experiments on 25 generated benchmarks by comparison with six state-of-the-art and modern algorithms. Moreover, the VRP4E in different epidemic situations and a real-world case in the Beijing-Tianjin-Hebei region, China, are further studied to provide helpful insights for combatting COVID-19-like epidemics.

Emergency logistics network optimization with time window assignment.

During natural disasters or accidents, an emergency logistics network aims to ensure the distribution of relief supplies to victims in time and efficiently. When the coronavirus disease 2019 (COVID-19) emerged, the government closed the outbreak areas to control the risk of transmission. The closed areas were divided into high-risk and middle-/low-risk areas, and travel restrictions were enforced in the different risk areas. The distribution of daily essential supplies to residents in the closed areas became a major challenge for the government. This study introduces a new variant of the vehicle routing problem with travel restrictions in closed areas called the two-echelon emergency vehicle routing problem with time window assignment (2E-EVRPTWA). 2E-EVRPTWA involves transporting goods from distribution centers (DCs) to satellites in high-risk areas in the first echelon and delivering goods from DCs or satellites to customers in the second echelon. Vehicle sharing and time window assignment (TWA) strategies are applied to optimize the transportation resource configuration and improve the operational efficiency of the emergency logistics network. A tri-objective mathematical model for 2E-EVRPTWA is also constructed to minimize the total operating cost, total delivery time, and number of vehicles. A multi-objective adaptive large neighborhood search with split algorithm (MOALNS-SA) is proposed to obtain the Pareto optimal solution for 2E-EVRPTWA. The split algorithm (SA) calculates the objective values associated with each solution and assigns multiple trips to shared vehicles. A non-dominated sorting strategy is used to retain the optimal labels obtained with the SA algorithm and evaluate the quality of the multi-objective solution. The TWA strategy embedded in MOALNS-SA assigns appropriate candidate time windows to customers. The proposed MOALNS-SA produces results that are comparable with the CPLEX solver and those of the self-learning non-dominated sorting genetic algorithm-II, multi-objective ant colony algorithm, and multi-objective particle swarm optimization algorithm for 2E-EVRPTWA. A real-world COVID-19 case study from Chongqing City, China, is performed to test the performance of the proposed model and algorithm. This study helps the government and logistics enterprises design an efficient, collaborative, emergency logistics network, and promote the healthy and sustainable development of cities.

Robust Task Scheduling for Heterogeneous Robot Teams Under Capability Uncertainty

This article develops a stochastic programming framework for multiagent systems, where task decomposition, assignment, and scheduling problems are simultaneously optimized. The framework can be applied to heterogeneous mobile robot teams with distributed subtasks. Examples include pandemic robotic service coordination, explore and rescue, and delivery systems with heterogeneous vehicles. Owing to their inherent flexibility and robustness, multiagent systems are applied in a growing range of real-world problems that involve heterogeneous tasks and uncertain information. Most previous works assume one fixed way to decompose a task into roles that can later be assigned to the agents. This assumption is not valid for a complex task where the roles can vary and multiple decomposition structures exist. Meanwhile, it is unclear how uncertainties in task requirements and agent capabilities can be systematically quantified and optimized under a multiagent system setting. A representation for complex tasks is proposed: agent capabilities are represented as a vector of random distributions, and task requirements are verified by a generalizable binary function. The conditional value at risk is chosen as a metric in the objective function to generate robust plans. An efficient algorithm is described to solve the model, and the whole framework is evaluated in two different practical test cases: capture-the-flag and robotic service coordination during a pandemic (e.g., COVID-19). Results demonstrate that the framework is generalizable, is scalable up to 140 agents and 40 tasks for the example test cases, and provides low-cost plans that ensure a high probability of success.

Last Mile Delivery with Parcel Lockers: evaluating the environmental impact of eco-conscious consumer behavior

In recent months, online sales have experienced a sharp surge also due to the COVID pandemic. In this paper, we propose a new location and routing problem for a last mile delivery service based on parcel lockers and introduce a mathematical formulation to solve it by means of a MIP solver (Gurobi).The presence of parcel locker stations avoids the door-to-door delivery by companies but requires that consumers move from home to collect their parcels. Potential location of locker stations is known but not all of them need to be opened. The problem minimizes the global environmental impact in terms of distances traveled by both the delivery company and the consumers deciding the optimal number of stations that have to be opened.How much do the number and location of lockers impact on environment? Is the behavior of consumers a critical aspect of such optimization? To this aim we have solved 1680 instances and analyzed diferent scenarios varying the number of consumers and potential parcel lockers, the maximum distance a consumer is willing to travel to reach a locker station, and the maximum distance we may assume the same consumer is willing to travel by foot or by bicycle.The experimental results draw interesting conclusions and managerial insights providing important rules of thumbs for environmental decision makers.Copyright (c) 2022 The Authors. This is an open access article under the CC BY-NC-ND license (https://creativecommons.org/licenses/by-nc-nd/4.0/)

A real-world Employee Bus Routing Problem application with mixed loads

In this paper, we consider a real-world application of the Employee Shuttle Bus Routing (ESBR) for a transportation company that provides shuttle services for an industrial group. We present a mathematical model that enables the company with mixed loads allowance and dis-allowance options, since the appearance of Covid-19 has banned the transportation of employees belonging to different workplaces on the same bus. We solved this model using the CPLEX solver and tested it on real-world data instances. However, the data set was large which made the exact solutions hard to obtain. Therefore, we sought to divide the data set into clusters using the Agglomerative Clustering algorithm and we ran the model on these groups independently. At the end of this paper, we present a comparison, in terms of execution time and objective value, of the model's results for mixed loads respectively allowed and forbidden. © 2022 IEEE.

Route Planning using Wireless Sensor Network for Garbage Collection in COVID-19 Pandemic

Garbage collection is a responsibility faced by all cities and, if not properly carried out, can generate greater costs or sanitary problems. Considering the sanitary situation due to the COVID-19 pandemic, it is necessary to take sanitary safety measures to prevent its spread. The challenge of the present work is to provide an efficient and effective solution that guarantees a garbage collection that optimizes the use of resources and prioritizes the attention to garbage containers located in or near contagion risk zones. To this end, this research proposes the integration of a basic garbage monitoring system, consisting of a wireless sensor network, and a route planning system that implements the decomposition of the Vehicle Routing problem into the subproblems of clustering and sequencing of containers using the K-Means and Ant Colony algorithms. For the monitoring of garbage, a significant reduction in the measurement error of waste level in the containers was achieved compared to other authors. About route planning, adequate error ranges were obtained in the calculation of the optimal values of distance traveled and travel time indicators with respect to an exhaustive enumeration of routes. © 2022. All Rights Reserved.

Customer-Centric, Two-Product Split Delivery Vehicle Routing Problem under Consideration of Weighted Customer Waiting Time in Power Industry

This paper introduces a new model of the customer-centric, two-product split delivery vehicle routing problem (CTSDVRP) in the context of a mixed-flow manufacturing system that occurs in the power industry. Different from the general VRP model, the unique characteristics of our model are: (1) two types of products are delivered, and the demand for them is interdependent and based on a bill of materials (BOM);(2) the paper considers a new aspect in customer satisfaction, i.e., the consideration of the production efficiency on the customer side. In our model, customer satisfaction is not measured by the actual customer waiting time, but by the weighted customer waiting time, which is based on the targeted service rate of the end products. We define the targeted service rate as the ratio of the quantity of the end product produced by the corresponding delivery quantities of the two products to the demand of the end product. We propose a hybrid ant colony-genetic optimization algorithm to solve this model with actual data from a case study of the State Grid Corporation of China. Finally, a case study is explored to assess the effectiveness of the CTSDVRP model and highlight some insights. The results show that the CTSDVRP model can improve customer satisfaction and increase the average targeted service rate of the end products effectively.

CLUSTERING ALGORITHM FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

The demand for daily food purchases has increased dramatically, especially during the Covid-19 pandemic. This requires suppliers to face a huge and complex problem of delivering products that meet the needs of their customers on a daily basis. It also puts great pressure on managers on how to make day-to-day decisions quickly and efficiently to both satisfy customer requirements and satisfy capacity constraints. This study proposes a combination of the cluster-first ??? route-second method and k-means clustering algorithm to deal with a large Vehicle Routing Problem with Time Windows (VRPTW) in the logistics and transportation field. The purpose of this research is to assist decision-makers to make quick and efficient decisions, based on optimal costs, the number of vehicles, delivery time, and truck capacity efficiency. A distribution system of perishable goods in Vietnam is used as a case study to illustrate the effectiveness of our mathematical model. In particular, perishable goods include fresh products of fish, chicken, beef, and pork. These products are packed in different sizes and transferred by vehicles with 1000 kg capacity. Besides, they are delivered from a depot to the main 39 customers of the company with arrival times following customers??? time window. All of the data are collected from a logistics company in Ho Chi Minh city (Vietnam). The result shows that the application of the clustering algorithm reduces the time for finding the optimal solutions. Especially, it only takes an average of 0.36 s to provide an optimal solution to a large Vehicle Routing Problem (VRP) with 39 nodes. In addition, the number of trucks, their operating costs, and their utilization are also shown fully. The logistics company needs 11 trucks to deliver their products to 39 customers. The utilization of each truck is more than 70%. This operation takes the total costs of 6586215.32 VND (Vietnamese Dong), of which, the transportation cost is 1086215.32 VND. This research mainly contributes an effective method for enterprises to quickly find the optimal solution to the problem of product supply.

Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings

Emergencies, such as pandemics (e.g., COVID-19), warrant urgent production and distribution of goods under disrupted supply chain conditions. An innovative logistics solution to meet the urgent demand during emergencies could be the factory-in-a-box manufacturing concept. The factory-in-a-box manufacturing concept deploys vehicles to transport containers that are used to install production modules (i.e., factories). The vehicles travel to customer locations and perform on-site production. Factory-in-a-box supply chain optimization is associated with a wide array of decisions. This study focuses on selection of vehicles for factory-in-a-box manufacturing and decisions regarding the optimal routes within the supply chain consisting of a depot, suppliers, manufacturers, and customers. Moreover, in order to contrast the options of factory-in-a-box manufacturing with those of conventional manufacturing, the location of the final production is determined for each customer (i.e., factory-in-a-box manufacturing with production at the customer location or conventional manufacturing with production at the manufacturer locations). A novel multi-objective optimization model is presented for the vehicle routing problem with a factory-in-a-box that aims to minimize the total cost associated with traversing the edges of the network and the total cost associated with visiting the nodes of the network. A customized multi-objective hybrid metaheuristic solution algorithm that directly considers problem-specific properties is designed as a solution approach. A case study is performed for a vaccination project involving factory-in-a-box manufacturing along with conventional manufacturing. The case study reveals that the developed solution method outperforms the ε-constraint method, which is a classical exact optimization method for multi-objective optimization problems, and several well-known metaheuristics. © 2022 Elsevier Ltd